On the Self Crossing Six Sided Figure Problem
نویسنده
چکیده
It was shown by Carbery, Christ, and Wright that any measurable set E in the unit square in R 2 not containing the corners of a rectangle with area greater than has measure bounded by O(q log 1). We remove the log under the additional assumption that the set does not contain the corners of any axis-parallel, possibly self-crossing hexagon with unsigned area bigger than. Our proof may be viewed as a bilinearization of Carbery, Christ, and Wright's argument.
منابع مشابه
On the Self Crossing Six Sided Figure Problem
It was shown by Carbery Christ and Wright that any measurable set E in the unit square in R not containing the corners of a rectangle with area greater than has measure bounded by O q log We remove the log under the additional assumption that the set does not contain the corners of any axis parallel possibly self crossing hexagon with unsigned area bigger than Our proof may be viewed as a bilin...
متن کاملMETAHEURISTIC ALGORITHMS FOR MINIMUM CROSSING NUMBER PROBLEM
This paper presents the application of metaheuristic methods to the minimum crossing number problem for the first time. These algorithms including particle swarm optimization, improved ray optimization, colliding bodies optimization and enhanced colliding bodies optimization. For each method, a pseudo code is provided. The crossing number problem is NP-hard and has important applications in eng...
متن کاملA Fast and Simple Heuristic for Constrained Two-Level Crossing Reduction
The one-sided two-level crossing reduction problem is an important problem in hierarchical graph drawing. Because of its NPhardness there are many heuristics, such as the well-known barycenter and median heuristics. We consider the constrained one-sided two-level crossing reduction problem, where the relative position of certain vertex pairs on the second level is fixed. Based on the barycenter...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملCrossing minimization in extended level drawings of graphs
The most popular method of drawing directed graphs is to place vertices on a set of horizontal or concentric levels, known as level drawings. Level drawings are well studied in Graph Drawing due to their strong application for the visualization of hierarchy in graphs. There are two drawing conventions: horizontal drawings use a set of parallel lines and radial drawings use a set of concentric c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999